Lecture 19 Last Time We Proved How Smooth Are Gaussians
نویسندگان
چکیده
Where We Are in the Proof We are trying to bound the quantity: Pr b 1 ,...,b d [dist(0, ∂((b 1. .. b d))) < ] Where the probability is over the distribution with density (d i=1 µ i (b i))[0 ∈ (b 1. .. b d)]vol((b 1. .. b d)) Also recall that the µ i are Gaussian with variance σ 2 ≤ 1 and have centers of norm ≤ Γ ≤ 1 + 4 d log(n). We will now prove a utility lemma which will be useful later.
منابع مشابه
Introduction to Cryptography November 2 , 2006 Lecture 20 : Digital Signatures II
In the last lecture, we developed a digital signature scheme for message in {0, 1} n and proved it to be one-time secure. We also showed how to construct a family of Collision-Resistant Hash Functions (CRH) and claimed that they would be useful in constructing one-time secure digital signature schemes for messages in {0, 1} *. The following theorem makes this claim more formally. Theorem 1 If t...
متن کاملCS 364 A : Algorithmic Game Theory Lecture # 3 : Myerson ’ s Lemma ∗
Last time, we introduced the Vickrey auction and proved that it enjoys three desirable and different guarantees: (1) [strong incentive guarantees] DSIC. That is, truthful bidding should be a dominant strategy (and never leads to negative utility). Don't forget the two reasons we're after the DSIC guarantee. First, such an auction is easy to play for bidders — just play the obvious dominant stra...
متن کاملLecture Notes on Proofs & Arithmetic
Lecture 8 on Events & Delays discussed and developed two models for the ping pong ball whose control was a ping pong paddle. First an event-driven controller and then a time-triggered controller. Invariants have been identified in Lecture 8 but not proved. This lecture will study proofs. This lecture discusses: • What is a proof? • How does arithmetic happen in a proof? • Arithmetic hiding to w...
متن کاملLecture 12 : April 13 , 2017
Last Time During the last lecture we completed an argument for a 2 1 d−1 ) lower bound for depth-d circuits for parity (PAR) using Hastad’s Switching Lemma [H̊as87], which stated that, for f : {0, 1} → {−1, 1}, if CNFwidth(f) = t, Pρ←Rp(DNFwidth(f ρ) = s) ≥ (7ps) We proved the Weak Switching Lemma, asserting a (40ps2) lower bound for this probability as opposed to the tighter bound given by the ...
متن کاملLecture 19 — November 15 , 2012
In the last lecture, we saw the graph powering method, which allows us to increase the soundness gap but has the drawback of increasing the alphabet size from |Σ| to |Σ|dt (where |Σ| is a constant). In this lecture, we describe how to reduce the alphabet size (from |Σ|dt back to |Σ|), while causing only a small decrease in the gap (and a constant factor increase in the constraint graph size). T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002